Evolving Heterogeneous Neural Agents by Local Selection

نویسندگان

  • Filippo Menczer
  • Melania Degeratu
چکیده

Evolutionary algorithms have been applied to the synthesis of neural architectures, but they normally lead to uniform populations. Homogeneous solutions, however, are inadequate for certain applications and models. For these cases, local selection may produce the desired heterogeneity in the evolving neural networks. This chapter describes algorithms based on local selection, and discusses the main differences distinguishing them from standard evolutionary algorithms. The use of local selection to evolve neural networks is illustrated by surveying previous work in three domains (simulations of adaptive behavior, realistic ecological models, and browsing information agents), as well as reporting on new results in feature selection for classification.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network

Abstract   Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...

متن کامل

Combinatorially Generated Piecewise Activation Functions

In the neuroevolution literature, research has primarily focused on evolving the number of nodes, connections, and weights in artificial neural networks. Few attempts have been made to evolve activation functions. Research in evolving activation functions has mainly focused on evolving function parameters, and developing heterogeneous networks by selecting from a fixed pool of activation functi...

متن کامل

Simulating Self-organising Social Recommendation

Open multi-agent systems are often formed from heterogeneous peers operating in a decentralised manner, therefore their constituent agents must evaluate possible actions and opportunities based on local, subjective knowledge. Given that this knowledge is determined by an agent’s social connections and interactions with its peers, we define two alternative algorithms for selecting peers based on...

متن کامل

Utilising social recommendation for decision-making in distributed multi-agent systems

Open multi-agent systems are typically formed from heterogeneous peers operating in a decentralised manner. Hence, their constituent agents must evaluate possible actions and opportunities based on local, subjective knowledge. When agents have insufficient personal experience, they may inevitably rely on their social connections to act as a source of relevant information or recommendations. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999